package 剑指offer;

public class _36二叉搜索树与双向链表 {
 /*   Node head,pre;
    public Node treeToDoublyList(Node root) {
        if(root == null){
            return null;
        }
        dfs(root);
        head.left = pre;
        pre.right = head;
        return head;

    }
    public void dfs(Node cur){
        if(cur == null){
            return ;
        }
        dfs(cur.left);
        if(pre == null){
            head = cur;
        }else{
            pre.right = cur;
            cur.left = pre;
        }
        pre = cur;
        dfs(cur.right);
    }*/
}
